Spectral partitions for Sturm–Liouville problems
نویسندگان
چکیده
منابع مشابه
Inverse spectral problems for Sturm-Liouville operators with transmission conditions
Abstract: This paper deals with the boundary value problem involving the differential equation -y''+q(x)y=lambda y subject to the standard boundary conditions along with the following discontinuity conditions at a point y(a+0)=a1y(a-0), y'(a+0)=a2y'(a-0)+a3y(a-0). We develop the Hochestadt-Lieberman’s result for Sturm-Lio...
متن کاملA Spectral Algorithm for Improving Graph Partitions
In the cut-improvement problem, we are asked, given a starting cut (T, T̄ ) in a graphG, to find a cut with low conductance around (T, T̄ ) or produce a certificate that there is none. More precisely, for a notion of correlation between cuts, cut-improvement algorithms seek to produce approximation guarantees of the following form: for any cut (C, C̄) that is ε-correlated with the input cut, the c...
متن کاملJudicious partitions and related problems
Many classical partitioning problems in combinatorics ask for a single quantity to be maximized or minimized over a set of partitions of a combinatorial object. For instance, Max Cut asks for the largest bipartite subgraph of a graphG, while Min Bisection asks for the minimum size of a cut into two equal pieces. In judicious partitioning problems, we seek to maximize or minimize a number of qua...
متن کاملGraph matching and clustering using spectral partitions
Although inexact graph-matching is a problem of potentially exponential complexity, the problem may be simplified by decomposing the graphs to be matched into smaller subgraphs. If this is done, then the process may cast into a hierarchical framework and hence rendered suitable for parallel computation. In this paper we describe a spectral method which can be used to partition graphs into nonov...
متن کاملReconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of the graph and two vertices are connected by an edge if and only if the associated items belong to the same class. In a planted partition model a graph that models a partition is given, which is obscured by random noise,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society of Edinburgh: Section A Mathematics
سال: 2019
ISSN: 0308-2105,1473-7124
DOI: 10.1017/prm.2019.1